On finitely recursive programs
نویسندگان
چکیده
منابع مشابه
On Finitely Recursive Programs
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable model semantics is Π11-hard. In this paper we prove that a larger class of programs, called finitely recursive programs, preserves most of the good properties...
متن کاملBottom-up Evaluation of Finitely Recursive Queries
The support for function symbols in logic programming under Answer Set Programming semantics (ASP) allows to overcome some modeling limitations of traditional ASP systems, such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Thus, the research is lately focusing on finding proper subclasses of A...
متن کاملSatisfiability Modulo Recursive Programs
We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We implemented our procedure and integrated it with the Z3 SMT solver and the Scala compiler. Our procedure is sound for counterexamples and for pro...
متن کاملConstructive Induction for Recursive Programs
This paper presents an algorithm for inducing recursive rst order Horn clause programs from examples without background knowledge. This algorithm invents new predicates and their de nitions exhaustively until the instances of a new predicate become the same as examples except for the name of the predicate. Our system CIRP switches into constructive induction mode using a new heuristic taking ad...
متن کاملRecursive Programs for Document Spanners
A document spanner models a program for Information Extraction (IE) as a function that takes as input a text document (string over a finite alphabet) and produces a relation of spans (intervals in the document) over a predefined schema. A well studied language for expressing spanners is that of the regular spanners: relational algebra over regex formulas, which are obtained by adding capture va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2009
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s147106840900372x